Generalized multipoint conjugate eigenvalue problems
نویسندگان
چکیده
منابع مشابه
Positive solutions and nonlinear multipoint conjugate eigenvalue problems ∗
Values of λ are determined for which there exist solutions in a cone of the n order nonlinear differential equation, u = λa(t)f(u), 0 < t < 1, satisfying the multipoint boundary conditions, u(ai) = 0, 0 ≤ j ≤ ni−1, 1 ≤ i ≤ k, where 0 = a1 < a2 < · · · < ak = 1, and ∑k i=1 ni = n, where a and f are nonnegative valued, and where both lim |x|→0+ f(x)/|x| and lim |x|→∞ f(x)/|x| exist.
متن کاملMultiple Solutions of Generalized Multipoint Conjugate Boundary Value Problems
We consider the boundary value problem y(n)(t) = P (t, y), t ∈ (0, 1) y(ti) = 0, j = 0, . . . , ni − 1, i = 1, . . . , r, where r ≥ 2, ni ≥ 1 for i = 1, . . . , r, ∑r i=1 ni = n and 0 = t1 < t2 < · · · < tr = 1. Criteria are offered for the existence of double and triple ‘positive’ (in some sense) solutions of the boundary value problem. Further investigation on the upper and lower bounds for t...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملTriple Positive Solutions for Multipoint Conjugate Boundary Value Problems
For the nth order nonlinear differential equation y(n)(t) = f(y(t)), t ∈ [0, 1], satisfying the multipoint conjugate boundary conditions, y(ai) = 0, 1 ≤ i ≤ k, 0 ≤ j ≤ ni − 1, 0 = a1 < a2 < · · · < ak = 1, and ∑k i=1 ni = n, where f : R→ [0,∞) is continuous, growth condtions are imposed on f which yield the existence of at least three solutions that belong to a cone.
متن کاملThe Jacobi-Davidson Method for Eigenvalue and Generalized Eigenvalue Problems
We consider variants of Davidson's method for the iterative computation of one or more eigenvalues and their corresponding eigenvectors of an n n matrix A. The original Davidson method 3], for real normal matrices A, may be viewed as an accelerated Gauss-Jacobi method, and the success of the method seems to depend quite heavily on diagonal dominance of A 3, 4, 17]. In the hope to enlarge the sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2000
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(00)00168-0